Monte-Carlo Kakuro
نویسنده
چکیده
Kakuro consists in filling a grid with integers that sum up to predefined values. Sums are predefined for each row and column and all integers have to be different in the same row or column. Kakuro can be modeled as a constraint satisfaction problem. Monte-Carlo methods can improve on traditional search methods for Kakuro. We show that a Nested Monte-Carlo Search at level 2 gives good results. This is the first time a nested search of level 2 gives good results for a Constraint Satisfaction problem.
منابع مشابه
Kinetic Monte Carlo Simulation of Oxalic Acid Ozonationover Lanthanum-based Perovskitesas Catalysts
Kinetic Monte Carlo simulation was applied to investigation of kinetics and mechanism of oxalic acid degradation by direct and heterogeneous catalytic ozonation. La-containing perovskites including LaFeO3, LaNiO3, LaCoO3 and LaMnO3 was studied as catalyst for oxalic acid ozonation. The reaction kinetic mechanisms of each abovementioned catalytic systems has been achieved. The rate constants val...
متن کاملMonte Carlo Simulation of Multiplication Factor in PIN In0.52Al0.48As Avalanche Photodiodes
In this paper, we calculate electron and hole impactionization coefficients in In0.52Al0.48As using a Monte Carlo modelwhich has two valleys and two bands for electrons and holesrespectively. Also, we calculate multiplication factor for electronand hole initiated multiplication regimes and breakdown voltagein In0.52Al0.48As PIN avalanche photodiodes. To validate themodel, we compare our simulat...
متن کاملApplication of Monte Carlo Simulation in the Assessment of European Call Options
In this paper, the pricing of a European call option on the underlying asset is performed by using a Monte Carlo method, one of the powerful simulation methods, where the price development of the asset is simulated and value of the claim is computed in terms of an expected value. The proposed approach, applied in Monte Carlo simulation, is based on the Black-Scholes equation which generally def...
متن کاملThe Computational Complexity of the Kakuro Puzzle, Revisited
We present a new proof of NP-completeness for the problem of solving instances of the Japanese pencil puzzle Kakuro (also known as Cross-Sum). While the NP-completeness of Kakuro puzzles has been shown before [T. Seta. The complexity of CROSS SUM. IPSJ SIG Notes, AL-84:51–58, 2002], there are still two interesting aspects to our proof: we show NP-completeness for a new variant of Kakuro that ha...
متن کاملMonte Carlo characterization of photoneutrons in the radiation therapy with high energy photons: a Comparison between simplified and full Monte Carlo models
Background: The characteristics of secondary neutrons in a high energy radiation therapy room were studied using the MCNPX Monte Carlo (MC) code. Materials and Methods: Two MC models including a model with full description of head components and a simplified model used in previous studies were implemented for MC simulations. Results: Results showed 4-53% difference between full and wit...
متن کامل